Cheeger Constant and Connectivity of Graphs
نویسندگان
چکیده
منابع مشابه
Eccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملCheeger constants of Platonic graphs
The Platonic graphs πn arise in several contexts, most simply as a quotient of certain Cayley graphs associated to the projective special linear groups. We show that when n = p is prime, πn can be viewed as a complete multigraph in which each vertex is itself a wheel on n + 1 vertices. We prove a similar structure theorem for the case of an arbitrary prime power. These theorems are then used to...
متن کاملEvery Graph with a Positive Cheeger Constant Contains a Tree with a Positive Cheeger Constant
It is shown that every (innnite) graph with a positive Cheeger constant contains a tree with a positive Cheeger constant. Moreover, for every nonnegative integer k there is a unique connected graph T(k) that has Cheeger constant k, but removing any edge from it reduces the Cheeger constant. This minimal graph, T(k), is a tree, and every graph G with Cheeger constant h(G) > k has a spanning fore...
متن کاملSpectrum of the Signless 1-Laplacian and the Dual Cheeger Constant on Graphs
Parallel to the signless Laplacian spectral theory, we introduce and develop the nonlinear spectral theory of signless 1-Laplacian on graphs. Again, the first eigenvalue μ1 of the signless 1-Laplacian precisely characterizes the bipartiteness of a graph and naturally connects to the maxcut problem. However, the dual Cheeger constant h+, which has only some upper and lower bounds in the Laplacia...
متن کاملLaplacians of graphs and Cheeger inequalities
We define the Laplacian for a general graph and then examine several isoperimetric inequalities which relate the eigenvalues of the Laplacian to a number of graphs invariants such as vertex or edge expansions and the isoperimetric dimension of a graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2002
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.2002.147